Nonconvexity of the capacity region of the multiple-access arbitrarily varying channel subject to constraints
نویسندگان
چکیده
منابع مشابه
Nonconvexity of the capacity region of the multiple-access arbitrarily varying channel subject to constraints
Abstruct-The random-code capacity region of the multiple-access arbitrarily varying channel subject to both state and input constraints is determined. Consideration of a simple erasure channel shows that the capacity region is not convex in general.
متن کاملOn the capacity region of the discrete additive multiple-access arbitrarily varying channel
The discrete additive multiple-access arbitrarily varying channel (AVC) with two senders and one receiver is considered. Necessary and sufficient conditions are given for its deterministic-code average-probability-of-error capacity region under a state constraint to have a nonempty interior. In the case that no state constraint is present, the capacity region is characterized exactly. In the ca...
متن کاملThe capacity of the arbitrarily varying channel revisited: Positivity, constraints
A well-known result of Ahlswede asserts that the determinis-tic code capacity of an arbitrarily varying channel (AVC), under the average error probability criterion, either equals its random code capacity or else is zero. A necessary and sufficient condition is identified for deciding between these alternatives, namely, the capacity is zero if and only if the AVC is symmetrizable. The capacity ...
متن کاملCapacity of the Gaussian arbitrarily varying channel
The Gaussian arbitrarily varying channel with input constraint r and state constraint 2 admits input sequences x = ( x l , , x , ~ ) of real numbers with Cxf 5 nT and state sequences s = ( 5 ,. , T , ~ ) of real numbers with L Y ~ 5 H A ; the output sequence x + s + V , where V = ( VI, , y , ) is a sequence of independent and identically distributed Gaussian random variables with mean 0 and var...
متن کاملNonconvexity of the Capacity Region of theMultiple - Access
| The random-code capacity region of the multiple-access arbitrarily varying channel subject to both state and input constraints is determined. Consideration of a simple erasure channel shows that the capacity region is not convex in general.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 1995
ISSN: 0018-9448
DOI: 10.1109/18.370123